Find:
Searching for depth sensitivity and image reconstruction analysis w/2 dense imaging arrays.
Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
No documents match Boolean query. Trying non-Boolean relevance query.
263 documents found. Only retrieving 250 documents (System busy - maximum reduced). Order: relevance to query.

Approximating Dense Cases of Covering Problems - Karpinski, Zelikovsky (1997)   (Correct)   (1 citation)
in the optimal solution OPT .For the purposes of analysis, let us modify the graph G by inserting edges
Approximating Dense Cases of Covering Problems Marek Karpinski and

www.cs.virginia.edu/~alexz/postscript/dense98.ps

A Methodology for Automatically Tuned Parallel.. - Katagiri, Kuroda, Kanada (2000)   (Correct)
organized as follows. Description of our parallel dense eigensolver in Section 2. Section 3 is about the
pi2.cc.u-tokyo.ac.jp/~katagiri/./paper/PA51_24_Katagiri.ps.gz

Data-level Parallel Solution of Min-cost Network Flow Problems.. - Li, Zenios (1994)   (Correct)
tolerence adjustment According to the complexity analysis given by Bertsekas and Tsitsiklis (1989]
"relaxation :8 3.2 Dense Implementation for Transportation Problems :

http.cs.berkeley.edu/~xiaoye/net.ps.gz

The Widest k-dense Corridor and Cylinder Problems - Shin, Shin, Chwa (1998)   (Correct)
QA or QB .The details including running time analysis are as follows. 1. Constructing A(H 0 from
The Widest k-dense Corridor and Cylinder Problems Chan-Su Shin Sung

cs.kaist.ac.kr/library/tr/Archive/CS-TR-98-121.ps

A Construction Of Rational Wavelets And Frames In.. - Ward, Partington (1998)   (Correct)   (3 citations)
disturbances, robust stability, and mixed sensitivity minimization, IEEE Trans. Automat. Control, 33
G(1-z)1z) 1 )A(D)Let A be the inverse image of A by (1-s)1s) 1 .Then, since the
B-A BA .If B is close to A we obtain a good reconstruction of f .Otherwise we can write down an

epubs.siam.org/sam-bin/getfile/SICON/articles/29733.ps.Z

Fast Rendering Techniques for Interactive Walkthroughs of Large .. - Lorenzetto (2001)   (Correct)
. 16 5.1.4 Layered Depth Images .
users expectations increase with respect to image quality and frame rates. Unfortunately,
.6 3.2 Dense or Sparse?

www.cs.uwa.edu.au/~gian/docs/visreport.ps

Verification of Dynamic Linear Lists for All Numbers of Processes - Wang   (Correct)
ffl V is a finite set of global state images for all system implementations with any number of
and Sm may transit from to 0 For safety analysis, if we can construct a finite CQS in which the
untimed systems with a global waiting queue and (2) dense-time systems with one local timer per process. We

www.iis.sinica.edu.tw/~farn/quo.full.ps

Automated Interpretation of Dense Range Data - Boehm, Fritsch (2003)   (Correct)
University of Stuttgart, Germany Keywords: Image Unders anding, Range Image, Clas4 fication,
Automated Interpretation of Dense Range Data Jan Bohm, Dieter Fritsch Institute

www.ifp.uni-stuttgart.de/publications/2003/boehm_spie_2003.pdf

An Efficient Algorithm for Dense Regions Discovery from.. - Yip, Wu, Ng, Chan (2004)   (Correct)
we apply our algorithms to clickstream analysis. 2 Definition of Dense Regions We now fix some
An E#cient Algorithm for Dense Regions Discovery from Large-Scale Data Streams

ftp.math.ucla.edu/pub/camreport/cam03-76.pdf

Die Analyse dynamischer Prozesse in Sequenzen von Tiefenkarten - Spies (2001)   (Correct)
novel differential constraint equations for the depth and intensity data are introduced. These
klimt.iwr.uni-heidelberg.de/~hspies/./pdf/Spies_PhD2001.pdf

W. M. Felter T. W. Keller M. D. Kistler C. Lefurgy K.. - On The Performance   (Correct)
rack of 42-U height, 19-inch width, and 30-inch depth, including the necessary cooling fans, system
into a cluster to provide a single system image. In that case, the limited memory of each SDS
provides the bulk of the quantitative performance analysis. In Section 5, we provide a further, qualitative

www.research.ibm.com/journal/rd/475/felter.pdf

A Polynomial Time Approximation Scheme for Inferring.. - Jiang, Kearney, Li (2000)   (Correct)   (13 citations)
of the set Q. To illustrate, consider the sensitivity of the Q method and the short quartet
1996. 16] A. Templeton. Human origins and analysis of mitochondrial dna sequences. Science,
quartet methods. To achieve this result the natural denseness of the set Q is exploited. The second result

www.math.uwaterloo.ca/~pkearney/sicomp.ps

Performance Modeling of Distributed Memory Architectures - Johnsson (1991)   (Correct)   (9 citations)
operations, then the time may be independent of the depth of the tree, as is also approximately the case
among the processors. Scaling Operation Dimension Dense Matrix-Vector Mpy d =2 Dense Matrix-Matrix Mpy d
shifts along several axes of multi-dimensional arrays, and emulation of butterfly networks. We also

ftp.das.harvard.edu/techreports/tr-10-91.ps.gz

Continual Learning for Mobile Robots - Großmann (2001)   (Correct)
objects positions of sensor readings camera image sensor data corrected position sonar and
high dimensionality of the model, a qualitative analysis of the probability distribution is difcult.
of Sonar Sensing .50 5.1.2 Dense Sensor Matching Techniques .

www.wv.inf.tu-dresden.de/~axg/Ftp/A.Grossmann/axg-thesis.pdf

On First Order Interval Temporal Logic - Dutertre (1995)   (Correct)   (26 citations)
sub-algebra (m(W )0) where m(W )D is the image of W by m. Other subsets of D are constrained to
5.1 Extensions of S 0 55 5.2 Axiomatizations of dense time 56 5.2.1 Dense temporal domains 56 5.2.2

www.csl.sri.com/users/bruno/publis/TR-CSD-94-3.ps.gz

I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (1995)   (Correct)   (1 citation)
that we believe can benefit from careful analysis and I/O-efficient implementation. These include
. 10 4.4 Dense Matrix Methods .
designed to model key ranking [5]We are given an array of integer keys K 0 K 1 KN \Gamma1

www.cs.duke.edu/~jsv/Papers/VeV97.Scientific_TPIE.ps.gz

Automatic 3D Model Acquisition from Uncalibrated Image.. - Koch, Pollefeys, Van Gool   (Correct)
by area matching. Finally, dense and accurate depth maps are computed by linking together all
Automatic 3D Model Acquisition from Uncalibrated Image Sequences Reinhard Koch, Marc Pollefeys, and Luc

www.esat.kuleuven.ac.be/~pollefey/publications/kochCGI98.pdf

Recursive Approach in Sparse Matrix LU Factorization - Dongarra, Eijkhout, Luszczek   (Correct)
nite element mesh, SIAM Journal of Numerical Analysis pp. 345-363, 1973. 23] N. E. Gibbs, W. G.
algebra codes has been proven very successful in dense matrix computations. An extension of the

icl.cs.utk.edu/news_pub/submissions/recur-sparse-sciprog.pdf

Subtly Different Facial Expression Recognition And Expression .. - Lien, Cohn, al. (1998)   (Correct)   (3 citations)
between two frames) while maintaining its sensitivity to subtle (sub-pixel) facial motion. In this
from the rigid head motion component, and the face images are automatically aligned and normalized using an
flow tracking together with principal component analysis (PCA)where the entire facial motion

www.cs.cmu.edu/afs/cs.cmu.edu/user/jjlien/www/cvpr98_4.ps.gz

An Empirical Analysis of Algorithms for Constructing a.. - Moret, Shapiro (1991)   (Correct)   (8 citations)
An empirical analysis of algorithms for constructing a minimum
with up to 130,000 nodes (sparse) or 750,000 edges (dense)Algorithms included in our experiments are
such considerations include the use of parallel arrays rather than records, the effect (in Pascal) of

www.cs.unm.edu/~moret/wads.ps

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC